28
28
Dec 19, 2017
12/17
by
Juan Manuel Dato Ruiz
texts
eye 28
favorite 0
comment 0
Generates a protocol to make secure a channel like DH. ----------------------- REVIEW 1 --------------------- PAPER: 2 TITLE: New algebra for secure channels AUTHORS: Juan Manuel Dato Ruiz A crackpot-ish paper containing nonsense and vacuous statements. Examples: * p1: "we can study other mecanisms in different numerical bases where we could find the same property with XOR, but granting smaller keys"; this contradicts the fact that n bits cannot carry more than n bits of...
Topics: security, hash, latin squares, DH
45
45
Nov 30, 2015
11/15
by
Juan Manuel Dato Ruiz
texts
eye 45
favorite 0
comment 1
Código en Python que resuelve SAT
( 1 reviews )
Topics: SAT, P, NP
204
204
Aug 17, 2012
08/12
by
Juan Manuel Dato Ruiz
texts
eye 204
favorite 0
comment 1
Here I got the simplest demonstrations that show us the philosophy that makes P=#P and the opposite philosophy of integers P not equals NP. In the DOC the last version reviewed.
( 1 reviews )
Topics: Godel, NP, #P, P
118
118
Feb 2, 2018
02/18
by
Juan Manuel Dato Ruiz
texts
eye 118
favorite 0
comment 1
Explanations in Jupyter in Python, with formulas in Latex. TQBF ~ SAT in P. Nowadays looking for a Journal to publish this technology. With explanations about both technologies: connectivism and constructivism. Explanations in English and Spanish. Dual. First version in English: https://sede.carm.es/eAConsultaWeb/consulta/mostrarDocumento.do
( 1 reviews )
Topics: pyhton, SAT, TQBF, P, NP, #SAT, FewP, MT
8
8.0
Jul 29, 2019
07/19
by
Juan Manuel Dato Ruiz
texts
eye 8
favorite 0
comment 1
Contruccion de un anillo para crear un noetheriano que resuelva cualquier formula de alternancias en tiempo O(n^2 log n).
( 1 reviews )
Topics: NP, SAT, anillo, noether, P
286
286
Oct 30, 2010
10/10
by
Juan Manuel Dato Ruiz
texts
eye 286
favorite 0
comment 1
FAIL. Bad use of the lemma. The result is a reduction which, perhaps, is not so interesting for the moment.
( 1 reviews )
Topics: Beal, conjeture, maths, integer, exponential, pows, coprimes
14
14
Dec 31, 2016
12/16
by
Juan Manuel Dato Ruiz
software
eye 14
favorite 0
comment 1
Files in Python 3.0 which solves satisfiability single and fast and when a theorem happens. This is the code from the book "The two Exact Philosophies", where it is commented with some examples. You can buy the book to support this author. Avaliable since 3rd-JAN-2017. https://www.morebooks.de/store/gb/book/the-two-exact-philosophies/isbn/978-3-330-02500-4
( 1 reviews )
Topic: NP co-NP
329
329
Jun 17, 2011
06/11
by
Juan Manuel Dato Ruiz
texts
eye 329
favorite 0
comment 0
Este ensayo consiste en la descripcion no revisada (escrita tal como me vino) de lo que defino como ismo. This is a document in Spanish about what is my meaning of ismo.
Topic: filosofia religion ciencia tecnologia consciencia
103
103
Aug 18, 2011
08/11
by
Juan Manuel Dato Ruiz
texts
eye 103
favorite 0
comment 0
Aqui se muestra un esbozo sobre distintas estrategias para poder crear un algebra con nuevas dimensiones compatibles con la idea de los cuaterniones. Su conexion con la fisica y su aplicabilidad es algo que aun no se ha ultimado en este documento, aunque muestra una notacion que puede ser util para este tipo de resoluciones. Tambien incluyo un par de clases en Python 2.7 para poder practicar las definiciones propuestas y asi crear una tabla multiplicadora.
Topics: algebra, dimensiones, cuaternion, octanion, fisica, pauli
211
211
Jan 25, 2011
01/11
by
Juan Manuel Dato Ruiz
texts
eye 211
favorite 0
comment 0
We can see here a conexion in python 3.0 between SAT3 and P. The #P is still under revision, but it works in a way. IMPROVED with matrices: https://archive.org/details/alternancias
Topic: #P SAT SAT3 satisfiability formula NP MT MTND polinomial
4
4.0
May 4, 2018
05/18
by
Juan Manuel Dato Ruiz
texts
eye 4
favorite 0
comment 0
Sistema simple de evaluación de traducciones bajo las técnicas WER y BLEU
Topics: WER, BLEU
8
8.0
Jun 15, 2019
06/19
by
Juan Manuel Dato Ruiz
software
eye 8
favorite 0
comment 0
This is a solution of the Quadratic Assingment Problem based on the Koopmans-Beckmann model. Solved in Polynomial time in Python 3.x.
Topics: NP-Hard, QAP, QAP-KB, SAT
1
1.0
Feb 2, 2018
02/18
by
Juan Manuel Dato Ruiz
texts
eye 1
favorite 0
comment 0
File in Jupyter which shows TQBF ~ SAT in P
Topics: TQBF, SAT, NP, P
13
13
Jan 26, 2016
01/16
by
Juan Manuel Dato Ruiz
software
eye 13
favorite 0
comment 1
This is a schematic documentation and the code itself that makes possible to calculate sharp problems if they are P-bounded. O(n2) in the worst case. And we can understand why the bound 2^V with V the number of variables works in the formula without any kind of problem.
( 1 reviews )
Topics: #SAT, NP, P
29
29
Jan 14, 2016
01/16
by
Juan Manuel Dato Ruiz
texts
eye 29
favorite 0
comment 1
This method is an approach to get sharp solutions. It works exactly solving SAT to understand how these structures work.
( 1 reviews )
Topics: #SAT, P
301
301
Feb 5, 2011
02/11
by
Juan Manuel Dato Ruiz
texts
eye 301
favorite 0
comment 0
That is a correction to the Cook's Theorem in Spanish and a definitive explanation about NP and P. Tras las ultimas investigaciones sobre los diversos teoremas falsos que hay en la informatica, al final he confeccionado la demostracion de que NP difiere de P partiendo de un proceso de enmarannamiento de la informacion que utilizo para llevar a cabo la creación de un canal seguro a partir de uno inseguro con verificacion. Es por ello que debo corregir el teorema de Cook mientras preparo...
Topics: algebra, NP, P, Cook, Theorem, firma, digital, dinero, electronico, logica
30
30
Oct 30, 2010
10/10
by
Juan Manuel Dato Ruiz
movies
eye 30
favorite 0
comment 0
We can find a connection between P and SAT if we solves the MATCH problem. Graphically we can understand the steps. I have to translate the formal demonstration, but it will be if there are peaple interested.
Topics: NP, P, SAT, match, NPco, resolution, example, flash, Español
29
29
Dec 19, 2017
12/17
by
Juan Manuel Dato Ruiz
texts
eye 29
favorite 0
comment 0
"Paper has moments of insight but is quite rambling" (-3: Strong reject) Have to read to believe. Si por lo menos hubiera sido un consejo reciclable...
Topics: AI, moral, ethics
180
180
Jun 23, 2011
06/11
by
Juan Manuel Dato Ruiz
texts
eye 180
favorite 0
comment 0
Se critica a los pilares del marxismo mientras se sigue defendiendo un modelo planificado. En futuros documentos mostraré un esquema definible dentro de la legislación española y programado en Java.
Topic: planificacion marxismo economia
2
2.0
Jan 26, 2016
01/16
by
Juan Manuel Dato Ruiz
texts
eye 2
favorite 0
comment 0
Code in Python able of calculating the number of cases of a formula in the analytical way exposed by the author. This author is waiting for making conferences. email: jumadaru@gmail.com
Topics: #SAT, P
482
482
Jan 7, 2011
01/11
by
Juan Manuel Dato Ruiz
texts
eye 482
favorite 0
comment 1
Failed. In lemma 3: A = 2; B = 1; n = 7; x = 3; This is an update from 12/10/16: https://archive.org/details/DemonstrationOfConjetureOfBealInThreePages
favorite ( 1 reviews )
254
254
Aug 16, 2012
08/12
by
Juan Manuel Dato Ruiz
texts
eye 254
favorite 0
comment 0
Al fin ya se puede dar uno por satisfecho, el pleno entendimiento de los problemas NP aparecen aqui reflejados. Estoy especulando con mostrar o no mi tecnologia #P, pero ya se ira viendo. En cualquier caso, esta documentacion pretende ser un primer esbozo para considerar su traduccion al ingles para ver si se publica o no.
Topics: NP, P, #P, cibernetic, spintronic
29
29
Jun 22, 2015
06/15
by
Juan Manuel Dato
image
eye 29
favorite 0
comment 0
Borran los mensajes sin moderación previa, sin que el usuario lo sepa, cuando el usuario lo denuncia lo ignoran o lo tratan como a un tonto. Permiten que otros usuarios anónimos increpen o incluso insulten a la víctima. Además el motivo del borrado no es porque el usuario insulte, ni trolee, ni lleve a cabo inundaciones de mensajes: se trata de motivos estratégicos de carácter político. Censura.
Topics: Podemos, secta, democracia, censura, captura
29
29
Jan 29, 2016
01/16
by
Juan Manuel Dato
texts
eye 29
favorite 0
comment 0
This is the Master Document from where I will study the way I have to format to show this Technology of sharping SAT. I already do not know if I will be able..., but there is no other way. This or Goodbye.
Topic: sharp
77
77
Jun 19, 2015
06/15
by
Juan Manuel Dato
texts
eye 77
favorite 0
comment 0
La gente se piensa que Podemos es un partido democrático, pero su cúpula se ha ocupado de que no sea así. En realidad, si Podemos ocupa el poder viviremos un tipo de tiranía orientado a la tecnocracia y a la idiocracia.
Topics: podemos, secta, democracia
209
209
Mar 7, 2011
03/11
by
Juan Manuel Dato Ruiz
texts
eye 209
favorite 0
comment 0
The theorem of Cook asserts something that cannot be used. We can find a relation between P and NP in a NP-complete and we can demonstrate NP is not P. Here some explanations that helps viewing the why.
Topics: cook theorem, satisfiability, NP-co, completeness, P, NP, boolean, validity, Cook
148
148
Mar 18, 2011
03/11
by
Juan Manuel Dato Ruiz
texts
eye 148
favorite 0
comment 0
Here you will read the demonstration SAT3 is in P. This assertion will be not enough to demonstrate NP=P because the problem con solving every formula well formed are more difficult and the NP-completeness Theorem have not got rigurousness.
Topics: NP, P, NP-Co, SAT, SAT3, Match, Boolean Validation, Problem, resolution
176
176
Mar 18, 2011
03/11
by
Juan Manuel Dato
texts
eye 176
favorite 0
comment 0
Demonstration NP is not P by a mechanism where datas generate correspondences hidding information which exists. In bounded systems of information is possible a way to get the knowledge, checking one by one, and a fast way of validation. REVIEW: I see this document is too difficult to get the objectives. I will rewrite it in other way easier and more rigorously, considearing I only need to translate the document and upload here.
Topics: NP, P, entanglement, P-Space, theorem, resolution
162
162
Feb 9, 2016
02/16
by
Juan Manuel Dato Ruiz
texts
eye 162
favorite 0
comment 1
How we can understand better the technology to make sharp implementations in class P and fast, or even intelligible. These documents in Python 3.0 and presentations for Open Office can be explained in conferences, workshops, etc by the author. email + donations by PayPal: jumadaru@gmail.com License: No for interest for IEEE or ACM Journals. IEEE and ACM are especially not interested in this technology. If you are an author of IEEE or ACM manuscript you are not authorized to use this work,...
( 1 reviews )
Topics: sharp, P, SAT
